Coding scheme for a wire-tap channel using regular codes
نویسندگان
چکیده
منابع مشابه
An Improved Feedback Coding Scheme for the Wire-tap Channel
Secure and reliable transmission over communication channels is first characterized by Wyner’s wiretap channel (WTC) model. In recent years, the WTC with noiseless feedback (WTC-NF) attracts a lot attention, and it has been shown that the legal receiver’s feedback enlarges the secrecy capacity of the WTC. Even so, the current feedback strategy for the WTC mainly focuses on generating key used f...
متن کاملAn efficient secure channel coding scheme based on polar codes
In this paper, we propose a new framework for joint encryption encoding scheme based on polar codes, namely efficient and secure joint secret key encryption channel coding scheme. The issue of using new coding structure, i.e. polar codes in Rao-Nam (RN) like schemes is addressed. Cryptanalysis methods show that the proposed scheme has an acceptable level of security with a relatively smaller ke...
متن کاملWire-Tap Codes as Side-Channel Countermeasure
In order to provide security against side-channel attacks a masking scheme which makes use of wire-tap codes has recently been proposed. The scheme benefits from the features of binary linear codes, and its application to AES has been presented in the seminal article. In this work – with respect to the underlying scheme – we re-iterate the fundamental operations of the AES cipher in a hopefully...
متن کاملThe Gaussian wire-tap channel
Wyner’s results for discrete memoryless wire-tap channels are extended to the Gaussian wire-tap channel. It is shown that the secrecy capacity C, is the difference between tbe capacit ies of the main and wire-tap channels. It is further shown tbat Rd= C, is the upper boundary of the achievable rate-equivocation region.
متن کاملMultilevel Input Ring-Tcm Coding Scheme: a Method for Generating High-Rate Codes
The capability of multilevel input ring-TCM coding scheme for generating high-rate codes with improved symbol Hamming and squared Euclidean distances is demonstrated. The existence of uniform codes and the decoder complexity are also considered.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1985
ISSN: 0012-365X
DOI: 10.1016/0012-365x(85)90026-3